Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs

Abstract This paper introduces a uniform substitution calculus for $${\textsf {d{}L}} {}_{\text {CHP}}$$ d L CHP , the dynamic logic of communicating hybrid programs. Uniform enables parsimonious prover kernels by using axioms instead axiom schemata. Instantiations can be recovered from single proof rule responsible soundness-critical instantiation checks rather than being spread across schemata in side conditions. Even though communication and parallelism reasoning are notorious necessitating subtle conditions, when generalized to manages limit isolate their conceptual overhead. Since has proven simplify implementation systems provers substantially, paves way theorem with parallelism.